Alternative Algorithm for Hilbert's Space-Filling Curve
نویسنده
چکیده
منابع مشابه
Self-Similar Structure in Hilbert's Space Filling Curve
Hilbert's spacelling curve is a continuous function that maps the unit interval onto the unit square. The construction of such curves in the 1890s surprised mathematicians of the time and led, in part, to the development of dimension theory. In this paper, we discuss how modern notions of selfsimilarity illuminate the structure of this curve. In particular, we show that Hilbert's curve has a ba...
متن کاملSpace Filling Curves for 3D Sensor Networks with Complex Topology
Several aspects of managing a sensor network (e.g., motion planning for data mules, serial data fusion and inference) benefit once the network is linearized to a path. The linearization is often achieved by constructing a space filling curve inside the domain. But existing methods cannot handle networks distributed on surfaces of complex topology. This paper presents a novel method for generati...
متن کاملA Closed-Form Algorithm for Converting Hilbert Space-Filling Curve Indices∗
We use the tensor product theory to formulate a closed-form algorithm for converting Hilbert space-filling curve indices of individual points. A twodimensional Hilbert space-filling curve is specified as a permutation which rearranges two-dimensional 2n×2n data elements stored in the row-major order as in C language or the column-major order as in FORTRAN language to the order of traversing a t...
متن کاملDigital halftoning algorithm based on random space-filling curve
SUMMARY This letter introduces a new digital halftoning technique based on error diffusion along a random space-filling curve. The purpose of introducing randomness is to erase regular patterns which tend to arise in an image area of uniform intensity. A simple algorithm for generating a random space-filling curve is proposed based on a random spanning tree and maze traversal. Some experimental...
متن کاملTime Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves
This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 20 شماره
صفحات -
تاریخ انتشار 1971